Search and navigation in dynamic environments from individual behaviors to population distributions
نویسندگان
چکیده
Animal movement receives widespread attention within ecology and behavior. However, much research is restricted within isolated sub-disciplines focusing on single phenomena such as navigation (e.g. homing behavior), search strategies (e.g. Levy flights) or theoretical considerations of optimal population dispersion (e.g. ideal free distribution). To help synthesize existing research, we outline a unifying conceptual framework that integrates individual-level behaviors and population-level spatial distributions with respect to spatio-temporal resource dynamics. We distinguish among (1) nonoriented movements based on diffusion and kinesis in response to proximate stimuli, (2) oriented movements utilizing perceptual cues of distant targets, and (3) memory mechanisms that assume prior knowledge of a target’s location. Species’ use of these mechanisms depends on life-history traits and resource dynamics, which together shape populationlevel patterns. Resources with little spatial variability should facilitate sedentary ranges, whereas resources with predictable seasonal variation in spatial distributions should generate migratory patterns. A third pattern, ‘nomadism’, should emerge when resource distributions are unpredictable in both space and time. We summarize recent advances in analyses of animal trajectories and outline three major components on which future studies should focus: (1) integration across alternative movement mechanisms involving links between state variables and specific mechanisms, (2) consideration of dynamics in resource landscapes or environments that include resource gradients in predictability, variability, scale, and abundance, and finally (3) quantitative methods to distinguish among population distributions. We suggest that combining techniques such as evolutionary programming and pattern oriented modeling will help to build strong links between underlying movement mechanisms and broad-scale population distributions.
منابع مشابه
A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملOptimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods
In the real world, many of the optimization issues are dynamic, uncertain, and complex in which the objective function or constraints can be changed over time. Consequently, the optimum of these issues is changed nonlinearly. Therefore, the optimization algorithms not only should search the global optimum value in the space but also should follow the path of optimal change in dynamic environmen...
متن کاملMulti-Step Learning to Search for Dynamic Environment Navigation
While navigation could be done using existing rule-based approaches, it becomes more attractive to use learning from demonstration (LfD) approaches to ease the burden of tedious rule designing and parameter tuning procedures. In our previous work, navigation in simple dynamic environments is achieved using the Learning to Search (LEARCH) algorithm with a proper feature set and the proposed data...
متن کاملDynamic Multi-Objective Navigation in Urban Transportation Network Using Ant Colony Optimization
Intelligent Transportation System (ITS) is one of the most important urban systems that its functionality affects other urban systems directly and indirectly. In developing societies, increasing the transportation system efficiency is an important concern, because variety of problems such as heavy traffic condition, rise of the accident rate and the reduced performance happen with the rise of p...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008